On the De Boer–Pellikaan method for computing minimum distance
نویسندگان
چکیده
منابع مشابه
On computing the minimum distance for faster than Nyquist signaling
Absfract -The degradation suffered when pulses satisfying the Nyquist criterion are used to transmit binary data at a rate faster than the Nyquist rate over the ideal band-limited (brick-wall) channel is studied. The minimum distance between received signals is used as a performance criterion. It is well-known that, when Nyquist pulses (i.e., pulses satisfying the Nyquist criterion) are sent at...
متن کاملThe geometric minimum action method for computing minimum energy paths.
An algorithm is proposed to calculate the minimum energy path (MEP). The algorithm is based on a variational formulation in which the MEP is characterized as the curve minimizing a certain functional. The algorithm performs this minimization using a preconditioned steepest-descent scheme with a reparametrization step to enforce a constraint on the curve parametrization.
متن کاملThe Accurate Method for Computing the Minimum Distance between a Point and an Elliptical Torus
We present an accurate method to compute the minimum distance between a point and an elliptical torus, which is called the orthogonal projection problem. The basic idea is to transform a geometric problem into finding the unique real solution of a quartic equation, which is fit for orthogonal projection of a point onto the elliptical torus. Firstly, we discuss the corresponding orthogonal proje...
متن کاملGlobal Hybrid Method for Computing the Minimum Distance Between a Point and a Plane Parametric Curve
Global convergent hybrid method is presented for computing the minimum distance between a point and a plane parametric curve. First, it uses a first order geometric iteration method. If iterative parametric value satisfied local Newton convergence condition and convergence in appropriate area, then turning to Newton iteration method. This hybrid method’s sensitivity to the choice of initial val...
متن کاملSome algorithms for computing the minimum distance of evaluation codes
Our purpose is to present some computations and estimates for the minimum distance of some families of evaluation codes. We introduce the Feng-Rao distance of an algebraic-geometry code and its extension to codes from order domains. Finally we give an algorithm to compute the Feng-Rao distance of a code from an order domain and we show its implementation in the computer algebra system SINGULAR.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2010
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2010.06.021